t = int(input())
for essa in range(t):
n = int(input())
s = list(map(int, input().split()))
posortowane = sorted(s)
for i in range(n):
if s[i] == posortowane[-1]:
print(s[i] - posortowane[-2], end = " ")
else:
print(s[i] - posortowane[-1], end = " ")
print()
'''
1
4
4 7 3 5
5
4
4 7 3 5
2
1 2
5
1 2 3 4 5
3
4 9 4
4
4 4 4 4
'''#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define len length()
#define begin begin()
#define end end()
#define num(a,s) count(a.begin,a.end,s)
#define nsort(a) sort(a.begin,a.end) //normal sort
#define rsort(a) sort(a.rbegin(),a.rend()) //reverse sort
#define psort(a) sort(a,a+n) //pair sort
#define rev(a) reverse(a.begin,a.end)
#define PB push_back
#define PI 3.1415926535
// #define n(x) x-'0'
#define x first
#define y second
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc; cin>>tc;
for(int i=0;i<tc;i++){
int n; cin>>n;
vector<int> a(n);
for(int j=0;j<n;j++) cin>>a[j];
int p=-1;
int m1=0,m2=0;
for(int j=0;j<n;j++){
if(a[j]>m1){
m1=a[j];
p=j;
}
}
for(int j=0;j<n;j++){
if(j!=p) m2=max(m2,a[j]);
}
for(int j=0;j<n;j++){
if(j==p) cout<<m1-m2<<" ";
else cout<<a[j]-m1<<" ";
}
cout<<endl;
}
}
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |